Computational problem - PDFSEARCH.IO - Document Search Engine

Computational problem
Results: 1172

#	Item
311	Book Reviews The Golden Ticket: P, NP, and the Search for the Impossible Lance Fortnow Princeton University Press, 2013, 192 pp ISBN1 Add to Reading List Source URL: www.asiapacific-mathnews.com Language: English - Date: 2014-02-27 03:55:07 Complexity classes NP-complete problems Mathematical optimization NP-complete Computational problems P versus NP problem NP Decision problem Clique problem Theoretical computer science Computational complexity theory Applied mathematics
312	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Terminal Steiner Tree with Bounded Edge Length Zhiyong Lin∗ Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:29:08 NP-complete problems Spanning tree Steiner tree problem Minimum spanning tree Time complexity Approximation algorithm Rectilinear Steiner tree Theoretical computer science Graph theory Computational complexity theory
313	Route Search over Probabilistic Geospatial Data Yaron Kanza1, , Eliyahu Safra2 , and Yehoshua Sagiv3, 1 2 Technion—Israel Institute of Technology Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2009-05-26 06:50:03 Approximation algorithm Computational complexity theory Travelling salesman problem Statistical hypothesis testing Theoretical computer science Statistics Applied mathematics
314	The Visibility Region of Points in a Simple Polygon Otfried Cheong Ren´e van Oostrum Hong Kong University of Science and Technology Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2003-06-20 16:02:14 Polytopes Art gallery problem Computational geometry Simple polygon Polyhedra Complex polytope Path decomposition Geometry Mathematics Polygons
315	Three Dimensional Bin Packing Problem with Variable Bin Height Yong Wu a,b,∗ , Wenkai Li b , Mark Goh b,c , Robert de Souza b a Institute b The Add to Reading List Source URL: www98.griffith.edu.au Language: English - Date: 2011-05-11 13:37:50 Packaging Operations research Discrete geometry Bin packing problem Mathematical optimization Computational complexity theory Packing problem Carton Bounded-error probabilistic polynomial Theoretical computer science Mathematics Applied mathematics
316	Complexity of 10 Decision Problems in Continuous Time Dynamical Systems Amir Ali Ahmadi IBM Watson Research Center Anirudha Majumdar MIT Add to Reading List Source URL: web.mit.edu Language: English - Date: 2013-06-23 10:21:36 Dynamical systems Stability theory Lyapunov function Lyapunov stability Quadratic Polynomial P versus NP problem Time complexity Lyapunov theory Theoretical computer science Mathematics Computational complexity theory
317	Paradox Issue 2, 2003 The Magazine of the Melbourne University Mathematics and Statistics Society Joe Healy Add to Reading List Source URL: www.ms.unimelb.edu.au Language: English - Date: 2011-11-19 03:23:12 Complexity classes Mathematical optimization W. B. R. Lickorish P versus NP problem Travelling salesman problem Time complexity NP Knot theory P Theoretical computer science Computational complexity theory Applied mathematics
318	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 A PTAS for the continuous 1.5D Terrain Guarding Problem Stephan Friedrichs∗ Michael Hemmer∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-07-28 18:32:50 Group theory Order Optimization problem NP-complete problems Network flow Combinatorial optimization Theoretical computer science Mathematics Computational complexity theory
319	On Two Class-Constrained Versions of the Multiple Knapsack Problem ∗ Hadas Shachnai † Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2013-04-15 10:32:13 Operations research Combinatorial optimization NP-complete problems Mathematical optimization Dynamic programming Knapsack problem Job shop scheduling Optimization problem Polynomial-time approximation scheme Theoretical computer science Computational complexity theory Applied mathematics
320	CCCG 2011, Toronto ON, August 10–12, 2011 Space-efficient Algorithms for Empty Space Recognition among a Point Set in 2D and 3D Minati De∗† Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Largest empty rectangle Algorithm Closest pair of points problem Reduction Computer science Computational geometry Beta skeleton Mathematics Applied mathematics Computational complexity theory

UPDATE